On Two-Sided Infinite Fixed Points of Morphisms
نویسندگان
چکیده
Let be a nite alphabet, and let h : ! be a morphism. Finite and innnite xed points of morphisms | i.e., those words w such that h(w) = w | play an important role in formal language theory. Head characterized the nite xed points of h, and later, Head and Lando characterized the one-sided innnite xed points of h. Our paper has two main results. First, we complete the characterization of xed points of morphisms by describing all two-sided innnite xed points of h, for both the \pointed" and \unpointed" cases. Second, we completely characterize the solutions to the equation h(xy) = yx in nite words.
منابع مشابه
Nonexpansive mappings on complex C*-algebras and their fixed points
A normed space $mathfrak{X}$ is said to have the fixed point property, if for each nonexpansive mapping $T : E longrightarrow E $ on a nonempty bounded closed convex subset $ E $ of $ mathfrak{X} $ has a fixed point. In this paper, we first show that if $ X $ is a locally compact Hausdorff space then the following are equivalent: (i) $X$ is infinite set, (ii) $C_0(X)$ is infinite dimensional, (...
متن کاملOn the Asymptotic Abelian Complexity of Morphic Words
The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts this number up to letter permutation. Although a lot of research has been done on the subword complexity of morphic words, i.e., words obtained as fixed points of iterated morphisms, little is known on their abelian complexity. In this paper, we undertake the classific...
متن کاملOn Two - Sided In nite
Let be a nite alphabet, and let h : ! be a morphism. Finite and innnite xed points of morphisms | i.e., those words w such that h(w) = w | play an important role in formal language theory. Head characterized the nite xed points of h, and later, Head and Lando characterized the one-sided innnite xed points of h. In this paper, we complete the characterization of xed points of morphisms by descri...
متن کاملOn Uniform Recurrence of a Direct Product
The direct product of two words is a naturally defined word on the alphabet of pairs of symbols. An infinite word is uniformly recurrent if each its subword occurs in it with bounded gaps. An infinite word is strongly recurrent if the direct product of it with each uniformly recurrent word is also uniformly recurrent. We prove that fixed points of the expanding binary symmetric morphisms are st...
متن کاملThe Lempel-Ziv Complexity of Fixed Points of Morphisms
The Lempel–Ziv complexity is a fundamental measure of complexity for words, closely connected with the famous LZ77 compression algorithm. We investigate this complexity measure for one of the most important families of infinite words in combinatorics, namely the fixed points of morphisms. We give a complete characterization of the complexity classes which are Θ(1), Θ(log n), and Θ(n1/k), k ∈ N,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999